Maximum bipartite flow in networks with adaptive channel width

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Bipartite Flow in Networks with Adaptive Channel Width

Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the links can be changed adaptively to suit the needs of specific applications. In particular, one gets a choice of having a few high capacity outgoing links or many low capacity ones...

متن کامل

Maximum Likelihood Bounded Tree-Width Markov Networks

We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatorial optimization problem of finding a maximum weight hypertree, we prove that it is NP-hard to solve exactly and provide an approximation algorithm with a provable performance guarantee.

متن کامل

Toughness of the Networks with Maximum Connectivity

The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

متن کامل

Maximum Flow in Planar Networks

Efficient algorithms for finding maximum flow in planar networks are presented. These algorithms take advantage of the planarity and are superior to the most efficient algorithms to date, If the source and the terminal are on the same face, an algorithm of Berge is improved and its time complexity is reduced to O(n log n). In the general case, for a given D > 0 a flow of value D is found if one...

متن کامل

Maximum lifetime problem in sensor networks with limited channel capacity

In the paper we analyze the maximum lifetime problem in sensor networks with limited channel capacity for multipoint-to-multipoint and broadcast data transmission services. We show, that in order to achieve an optimal data transmission regarding the maximum lifetime problem we cannot allow for any interference of signals. We propose a new Signal to Interference plus Noise Ratio function and use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2011

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2010.10.023